A constructive game semantics for the language of linear logic
نویسندگان
چکیده
منابع مشابه
A Constructive Game Semantics for the Language of Linear Logic
I present a semantics for the language of first order additive-multiplicative linear logic, i.e. the language of classical first order logic with two sorts of disjunction and conjunction. The semantics allows us to capture intuitions often associated with linear logic or constructivism such as sentences=games, sentences=resources or sentences=problems, where “truth” means existence of an effect...
متن کاملA Game Semantics for Linear Logic
Blass, A., A game semantics for linear logic, Annals of Pure and Applied Logic 56 (1992) 183-220. We present a game (or dialogue) semantics in the style of Lorenzen (1959) for Girard’s linear logic (1987). Lorenzen suggested that the (constructive) meaning of a proposition 91 should be specified by telling how to conduct a debate between a proponent P who asserts p and an opponent 0 who denies ...
متن کاملQuantitative Game Semantics for Linear Logic
We present a game-based semantic framework into which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of interaction framework introduced by the first author. In our model the time measure is given by means of slots, as introduced by Ghica in a recent paper. The cost associated to a strategy is polynomially related to...
متن کاملConstructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the “next” temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time analysis via the Curry-Howard isomorphism. However, he did not investigate the logic itself in detail; he has proved only that the logic augmented...
متن کاملA Game Semantics Foundation for Logic Programming
We introduce a semantics of Logic Programming based on classical Game Theory, which is proven to be sound and complete w.r.t. traditional semantics like the minimum Herbrand model and the s-semantics. This AND compositional game semantics allows a very simple characterization of the solution set of a logic program in term of approximations of the value of the game associated to it, which can al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1997
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(97)00046-8